Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs.
نویسندگان
چکیده
منابع مشابه
The (normalized) Laplacian Eigenvalue of Signed Graphs
Abstract. A signed graph Γ = (G, σ) consists of an unsigned graph G = (V, E) and a mapping σ : E → {+,−}. Let Γ be a connected signed graph and L(Γ),L(Γ) be its Laplacian matrix and normalized Laplacian matrix, respectively. Suppose μ1 ≥ · · · ≥ μn−1 ≥ μn ≥ 0 and λ1 ≥ · · · ≥ λn−1 ≥ λn ≥ 0 are the Laplacian eigenvalues and the normalized Laplacian eigenvalues of Γ, respectively. In this paper, ...
متن کاملGraphs with small second largest Laplacian eigenvalue
Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...
متن کاملBipartite graphs with small third Laplacian eigenvalue
In this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipartite graphs with the third eigenvalue of their adjacency matrices less than one. c © 2003 Elsevier...
متن کاملOn Cheng’s Eigenvalue Comparison Theorems
We prove Cheng’s eigenvalue comparison theorems [4] for geodesic balls within the cut locus under weaker geometric hypothesis, Theorems (1.1, 3.1, 3.2) and we also show that there are certain geometric rigidity in case of equality of the eigenvalues. This rigidity becomes isometric rigidity under upper sectional curvature bounds or lower Ricci curvature bounds. We construct examples of smooth m...
متن کاملBounds for the Largest Laplacian Eigenvalue of Weighted Graphs
Let G = (V, E) be simple graphs, as graphs which have no loops or parallel edges such that V is a finite set of vertices and E is a set of edges. A weighted graph is a graph each edge of which has been assigned to a square matrix called the weight of the edge. All the weightmatrices are assumed to be of same order and to be positive matrix. In this paper, by “weighted graph” we mean “a weighted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 1999
ISSN: 1347-6157,1340-9050
DOI: 10.4036/iis.1999.157